Abstract Model Checking and Refinement of Temporal Logic in aSPIN
نویسندگان
چکیده
Model Checking and Refinement of Temporal Logic in SPIN Marı́a del Mar Gallardo, Jesús Martı́nez, Pedro Merino, Ernesto Pimentel Computer Science Department, University of Malaga 29071 Malaga , SPAIN gallardo,jmcruz, pedro, ernesto @lcc.uma.es
منابع مشابه
Log Auditing through Model-Checking
Log auditing is a basic intrusion detection mechanism, whereby attacks are detected by uncovering matches of sequences of events against signatures. We argue that this problem is naturally expressed as a model-checking problem against linear Kripke models. A variant of the classic linear time temporal logic of Manna and Pnueli with first-order variables is first investigated in this framework. ...
متن کاملDon't Know in Probabilistic Systems
In this paper the abstraction-refinement paradigm based on 3-valued logics is extended to the setting of probabilistic systems. We define a notion of abstraction for Markov chains. To be able to relate the behavior of abstract and concrete systems, we equip the notion of abstraction with the concept of simulation. Furthermore, we present model checking for abstract probabilistic systems (abstra...
متن کاملCounterexample-guided Abstraction Refinement for Model Checking ATL
Preliminaries Alternating-time temporal logic (ATL) [1] is designed to specify collaborative as well as adversarial interaction between different components of a distributed system. Checking the validity of an alternating-time property in an explicit model is cheap: linear in the size of the formula and the model. Alternating transition systems (ATS) are used to model reactive components and th...
متن کاملVerifying and Constructing Abstract TLA Specifications: Application to the Verification of C programs
One approach to verify the correctness of a system is to prove that it implements an executable (specification) model whose correctness is more obvious. Here, we define a kind of automata whose state is the product of values of multiple variables that we name State Transition System (STS). We define the semantics of TLA+ (specification language of the Temporal Logic of Actions) constructs using...
متن کاملThe Fixpoint Checking Problem: An Abstraction Refinement Perspective
Model-checking is an automated technique which aims at verifying properties of computer systems. A model-checker is fed with a model of the system (which capture all its possible behaviors) and a property to verify on this model. Both are given by a convenient mathematical formalism like, for instance, a transition system for the model and a temporal logic formula for the property. For several ...
متن کامل